Welcome to our monthly digest, where you can catch up with any AIhub stories you may have missed, peruse the latest news, recap recent events, and more. This month, we hear from AfriClimate AI co-founder Amal Nammouchi, learn about the kidney exchange problem, and find out how to improve the interpretability of logistic regression models. This month, we had the pleasure of chatting to Amal Nammouchi, co-founder of AfriClimate AI, a grassroots community focused on using artificial intelligence to tackle climate challenges in Africa. Amal told us about the inspiration behind the initiative, some of their activities and projects, and plans for the future. In this blog post, Danial Dervovic writes about work presented at IJCAI 2024 on improving the interpretability of logistic regression models.

An example assignment with a cycle and a path maximizing the number of patients helped. In their work Parameterized Complexity of Kidney Exchange Revisited, presented at IJCAI 2024, Úrsula Hébert-Johnson, Daniel Lokshtanov, Chinmay Sonar and Vaishali Surianarayanan consider the Kidney Exchange Problem. We hear from Úrsula, Chinmay and Vaishali about kidney exchange, and how they went about solving two of the open problems in this field. Kidney disease affects tens of thousands of patients in the United States and hundreds of millions across the world. One way to treat kidney failure is to regularly undergo dialysis.

Kidney exchange is a type of barter market where patients exchange willing but incompatible donors. These exchanges are conducted via cycles---where each incompatible patient-donor pair in the cycle both gives and receives a kidney---and chains, which are started by an altruist donor who does not need a kidney in return. Finding the best combination of cycles and chains is hard. The leading algorithms for this optimization problem use either branch and price — a combination of branch and bound and column generation — or constraint generation. We show a correctness error in the leading prior branch-and-price-based approach [Glorie et al. 2014]. We develop a provably correct fix to it, which also necessarily changes the algorithm's complexity, as well as other improvements to the search algorithm. Next, we compare our solver to the leading constraint-generation-based solver and to the best prior correct branch-and-price-based solver. We focus on the setting where chains have a length cap. A cap is desirable in practice since if even one edge in the chain fails, the rest of the chain fails: the cap precludes very long chains that are extremely unlikely to execute and instead causes the solution to have more parallel chains and cycles that are more likely to succeed. We work with the UNOS nationwide kidney exchange, which uses a chain cap. Algorithms from our group autonomously make the transplant plans for that exchange. On that real data and demographically-accurate generated data, our new solver scales significantly better than the prior leading approaches.